Very nilpotent basis and n-tuples in Borel subalgebras

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nilpotent Orbits and Theta-stable Parabolic Subalgebras

In this work, we present a new classification of nilpotent orbits in a real reductive Lie algebra g under the action of its adjoint group. Our classification generalizes the Bala-Carter classification of the nilpotent orbits of complex semisimple Lie algebras. Our theory takes full advantage of the work of Kostant and Rallis on pC , the “complex symmetric space associated with g”. The Kostant-S...

متن کامل

Verma Modules Induced from Nonstandard Borel Subalgebras

In this paper we study composition series and em-beddings of Verma modules induced from "nonstandard" Borel subalgebras. This article can be viewed as a generalization of Futorny's work on imaginary Verma modules for Λ\ ' where the center of the Kac-Moody algebra acts nontrivially. Introduction. Let A be an indecomposable symmetrizable generalized Cartan matrix, fl(A) = n_ © f) 0 n+ the triangu...

متن کامل

Abelian Ideals with given Dimension in Borel Subalgebras

A well-known Peterson’s theorem says that the number of abelian ideals in a Borel subalgebra of a rank-r finite dimensional simple Lie algebra is exactly 2r . In this paper, we determine the dimensional distribution of abelian ideals in a Borel subalgebra of finite dimensional simple Lie algebras, which is a refinement of the Peterson’s theorem capturing more Lie algebra invariants.

متن کامل

Orbits on n-tuples

A transitive (infinite) permutation group which has m orbits on ordered pairs of distinct points has at least mn−1 orbits on ordered n-tuples. This is best possible, and groups attaining the bound can be characterised.

متن کامل

Low n Boolean Subalgebras

Every lown Boolean algebra, for 1 ≤ n ≤ 4, is isomorphic to a computable Boolean algebra. It is not yet known whether the same is true for n > 4. However, it is known that there exists a low5 subalgebra of the computable atomless Boolean algebra which, when viewed as a relation on the computable atomless Boolean algebra, does not have a computable copy. We adapt the proof of this recent result ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Comptes Rendus Mathematique

سال: 2011

ISSN: 1631-073X

DOI: 10.1016/j.crma.2010.12.005